Proximal Parallel Alternating Direction Method for Monotone Structured Variational Inequalities
نویسندگان
چکیده
In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some preliminary numerical results, which indicate that the new method is quite efficient. Keywords—structured variational inequalities, proximal point method, global convergence
منابع مشابه
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملAn Inexact Proximal Alternating Directions Method For Structured Variational Inequalities∗
In this paper we propose an appealing inexact proximal alternating directions method (abbreviated as In-PADM) for solving a class of monotone variational inequalities with certain special structure, and this structure under consideration is common in practice. We prove convergence of In-PADM method while the inexact term is arbitrary but satisfied some suitable conditions. For solving the varia...
متن کاملA Hybrid LQP Alternating Direction Method for Solving Variational Inequality Problems with Separable Structure
In this paper, we presented a logarithmic-quadratic proximal alternating direction method for structured variational inequalities. The method generates the new iterate by searching the optimal step size along the descent direction. Global convergence of the new method is proved under certain assumptions.
متن کاملProximal alternating direction-based contraction methods for separable linearly constrained convex optimization
Alternating direction method (ADM) has been well studied in the context of linearly constrained convex programming problems. Recently, because of its significant efficiency and easy implementation in novel applications, ADM is extended to the case where the number of separable parts is a finite number. The algorithmic framework of the extended method consists of two phases. On each iteration it...
متن کاملOn LQP alternating direction method for solving variational inequality problems with separable structure
In this paper, we proposed a logarithmic-quadratic proximal alternating direction method for structured variational inequalities. The new iterate is obtained by a convex combination of the previous point and the one generated by a projection-type method along a new descent direction. Global convergence of the new method is proved under certain assumptions. We also reported some numerical result...
متن کامل